Extensional Paramodulation for Higher-Order Logic and Its Effective Implementation Leo-III
نویسندگان
چکیده
منابع مشابه
Extensional Higher-Order Paramodulation and RUE-Resolution
This paper presents two approaches to primitive equality treatment in higher-order (HO) automated theorem proving: a calculus EP adapting traditional first-order (FO) paramodulation [RW69] , and a calculus ERUE adapting FO RUE-Resolution [Dig79] to classical type theory, i.e., HO logic based on Church’s simply typed λ-calculus. EP and ERUE extend the extensional HO resolution approach ER [BK98a...
متن کاملA Extensional Higher-Order Logic Programming
The two most prominent declarative paradigms, namely logic and functional programming, differ radically in an important aspect: logic programming is traditionally firstorder while functional programming encourages and promotes the use of higher-order functions and constructs. This difference can be partially explained by the fact that higher-order logic fails in terms of vital properties such a...
متن کاملThe Higher-Order Prover Leo-III
The automated theorem prover Leo-III for classical higherorder logic with Henkin semantics and choice is presented. Leo-III is based on extensional higher-order paramodulation and accepts every common TPTP dialect (FOF, TFF, THF), including their recent extensions to rank-1 polymorphism (TF1, TH1). In addition, the prover natively supports almost every normal higher-order modal logic. Leo-III c...
متن کاملExtensional Semantics for Higher-Order Logic Programs with Negation
We develop an extensional semantics for higher-order logic programs with negation, generalizing the technique that was introduced in [2, 3] for positive higher-order programs. In this way we provide an alternative extensional semantics for higher-order logic programs with negation to the one proposed in [6]. As an immediate useful consequence of our developments, we define for the language we c...
متن کاملProof Procedures for Extensional Higher-Order Logic Programming
We consider an extensional higher-order logic programming language which possesses the minimum Herbrand model property. We propose an SLD-resolution proof procedure and we demonstrate that it is sound and complete with respect to this semantics. In this way, we extend the familiar proof theory of first-order logic programming to apply to the more general higher-order case. We then enhance our s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KI - Künstliche Intelligenz
سال: 2019
ISSN: 0933-1875,1610-1987
DOI: 10.1007/s13218-019-00628-8